Binary Linear Codes With Few Weights From Two-to-One Functions

نویسندگان

چکیده

In this paper, we apply two-to-one functions over b F 2n in two generic constructions of binary linear codes. We consider forms: (1) generalized quadratic functions; and (2) (x 2t +x) xmlns:xlink="http://www.w3.org/1999/xlink">e with gcd(t, n)=gcd(e, 2 xmlns:xlink="http://www.w3.org/1999/xlink">n -1)=1. Based on the study Walsh transforms those or their variants, present many classes codes few nonzero weights, including one weight, three four five weights. The weight distributions proposed weights are determined. addition, discuss minimum distance dual constructed show that some them achieve sphere packing bound. Moreover, examples paper have best-known parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear codes with few weights from inhomogeneous quadratic functions

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with a few weights are constructed from inhomogeneous quadratic functions over the finite field GF(p), where p is an odd prime. They include some earlier li...

متن کامل

Several Classes of $p$-ary Linear Codes with Few Weights

Few weights codes have been an important topic of coding theory for decades. In this paper, a class of two-weight and three-weight codes for the homogeneous metric over the chain ring R = Fp + uFp + · · ·+ uFp are constructed. These codes are defined as trace codes. They are shown to be abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, we giv...

متن کامل

Linear codes with two or three weights from quadratic Bent functions

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions...

متن کامل

Binary linear codes with at most 4 weights

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used in secret sharing schemes. Index...

متن کامل

Binary quasi-perfect linear codes from APN quadratic functions

A mapping f from F2m to itself is almost perfect nonlinear (APN) if its directional derivatives in nonzero directions are all 2-to-1. Let Cf be the binary linear code of length 2 − 1, whose parity check matrix has its j-th column [ π f(π) ] , where π is a primitive element in F2m and j = 0, 1, · · · , 2 − 2. For m ≥ 3 and any quadratic APN function f(x) = ∑m−1 i,j=0 ai,jx 2+2 , ai,j ∈ F2m , it ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2021

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2021.3068743